Traffic Grooming in WDM Networks
نویسندگان
چکیده
The recent emergence of wavelength-division multiplexing technology has led to a tremendous increase in the available transmission capacity in wide area networks. Consequently, these networks may no longer be limited by transmission bandwidth, but rather by the processing capability of electronic switches, routers, and multiplexers in the network. This realization has led to a new wave of research aimed at overcoming the electronic bottleneck by providing optical bypass at the WDM layer. Traffic grooming can be used as a bypass mechanism by which low-rate circuits are assigned to wavelengths in order to minimize the amount of electronic multiplexing equipment. Recently, this topic has received a significant amount of attention in both the research and commercial arenas. In this article we give an overview of the traffic grooming problem and survey some representative work in this area. While most recent work has focused on grooming in SONET rings, grooming traffic in general mesh networks is an important emerging problem.
منابع مشابه
School of Computer Science Literature Review and Survey (0360-510, Fall 2006) Heuristics for Traffic Grooming in WDM Optical Networks with Shared Path Protection
The emergence of wavelength division multiplexing (WDM) technology has significantly increased the transmission capacity of a link in today's optical networks. In WDM networks, the bandwidth request of a traffic stream is usually much lower than the capacity of a wavelength. Traffic grooming can aggregate low-rate connections onto high-capacity optical fibers to make an efficient use of the ban...
متن کاملDynamic Traffic Grooming using Fixed-Alternate Routing in WDM Mesh Optical Networks
There is a mismatch between lightpath channel capacity and traffic request capacity in wavelength division multiplexed (WDM) optical mesh networks. Traffic grooming is needed to resolve this mismatch in an efficient way. We study the dynamic traffic grooming problem in WDM mesh networks using the fixed-alternate routing (FAR) approach. Based on the FAR approach, we propose the fixed-order groom...
متن کاملDynamic Multicast Traffic Grooming in WDM Networks with Reconfigurable Light-trees
We address the traffic grooming problem in WDM mesh networks with dynamic multicast traffic. We develop a grooming algorithm in which light-trees can dynamically be reconfigured when a new route is established. c © 2004 Optical Society of America OCIS codes: (060.4250) Networks
متن کاملMetaheuristic Approaches to Traffic Grooming in Wdm Optical Networks
The widespread deployment of WDM optical networks posts lots of new challenges for network designers. Traffic grooming is one of the most common problems. Efficient grooming of traffic can effectively reduce the overall cost of the network. But unfortunately, traffic grooming problems have been shown to be NP-hard. Therefore, new heuristics must be devised to tackle them. Among these approaches...
متن کاملOptimized Dynamic Traffic Grooming for Multicast Traffic in Optical WDM Networks
The dynamic traffic-grooming problem in wavelength routed networks is generally a two-layered routing problem in which traffic connections are routed over light paths in the virtual topology layer and light paths are routed over physical links in the physical topology layer. Traffic grooming for multicast communication in WDM networks has received very little attention to date. In this paper, w...
متن کاملInter - Semester 2011 Handout 13 1 5 Traffic Grooming inWavelength - RoutedWDMNet
In the last chapter, we assume that each source-destination (s-d) pair has its taffic demand equal to an integer multiple of wavelength unit. Accordingly, supporting such traffic in transparent wavelength division multiplexing (WDM) networks can be done by establishing lightpaths between s-d pairs. In addition, these established lightpaths will be fully utilized. In this chapter, we allow for s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001